Bijections from Weighted Dyck Paths to Schröder Paths
نویسنده
چکیده
Kim and Drake used generating functions to prove that the number of 2-distant noncrossing matchings, which are in bijection with little Schröder paths, is the same as the weight of Dyck paths in which downsteps from even height have weight 2. This work presents bijections from those Dyck paths to little Schröder paths, and from a similar set of Dyck paths to big Schröder paths. We show the effect of these bijections on the corresponding matchings, find generating functions for two new classes of lattice paths, and demonstrate a relationship with 231-avoiding permutations.
منابع مشابه
A Bijection Between 3-Motzkin Paths and Schröder Paths With No Peak at Odd Height
A new bijection between 3-Motzkin paths and Schröder paths with no peak at odd height is presented, together with numerous consequences involving related combinatorial structures such as 2-Motzkin paths, ordinary Motzkin paths and Dyck paths.
متن کاملBijections from Dyck paths to 321-avoiding permutations revisited
There are at least three di erent bijections in the literature from Dyck paths to 321-avoiding permutations, due to Billey-Jockusch-Stanley, Krattenthaler, and Mansour-Deng-Du. How di erent are they? Denoting them B;K;M respectively, we show that M = B Æ L = K Æ L where L is the classical Kreweras-Lalanne involution on Dyck paths and L0, also an involution, is a sort of derivative of L. Thus K ...
متن کاملFrom (2, 3)-Motzkin Paths to Schröder Paths
In this paper, we provide a bijection between the set of restricted (2, 3)-Motzkin paths of length n and the set of Schröder paths of semilength n. Furthermore, we give a one-to-one correspondence between the set of (2, 3)-Motzkin paths of length n and the set of little Schröder paths of semilength n + 1. By applying the bijections, we get the enumerations of Schröder paths according to the sta...
متن کاملStaircase Tilings and Lattice Paths
We define a combinatorial structure, a tiling of the staircase in the R plane, that will allow us, when restricted in different ways, to create direct bijections to Dyck paths of length 2n, Motzkin paths of lengths n and n−1, as well as Schröder paths and little Schröder paths of length n.
متن کاملChung-Feller Property in View of Generating Functions
The classical Chung-Feller Theorem offers an elegant perspective for enumerating the Catalan number cn = 1 n+1 ( 2n n ) . One of the various proofs is by the uniformpartition method. The method shows that the set of the free Dyck n-paths, which have ( 2n n ) in total, is uniformly partitioned into n + 1 blocks, and the ordinary Dyck n-paths form one of these blocks; therefore the cardinality of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010